Computing the decomposition group of a zero-dimensional ideal by elimination method
نویسنده
چکیده
In this note, we show that the decomposition group Dec(I) of a zero-dimensional radical ideal I in K[x1, . . . , xn] can be represented as the direct sum of several symmetric groups of polynomials based upon using Gröbner bases. The new method makes a theoretical contribution to discuss the decomposition group of I by using Computer Algebra without considering the complexity. As one application, we also present an approach to yield new triangular sets in computing triangular decomposition of polynomial sets P if Dec(< P >) is known.
منابع مشابه
Interval-Valued Hesitant Fuzzy Method based on Group Decision Analysis for Estimating Weights of Decision Makers
In this paper, a new soft computing group decision method based on the concept of compromise ratio is introduced for determining decision makers (DMs)' weights through the group decision process under uncertainty. In this method, preferences and judgments of the DMs or experts are expressed by linguistic terms for rating the industrial alternatives among selected criteria as well as the relativ...
متن کاملAlgebraic Local Cohomology with Parameters and Parametric Standard Bases for Zero-Dimensional Ideals
A computation method of algebraic local cohomology with parameters, associated with zerodimensional ideal with parameter, is introduced. This computation method gives us in particular a decomposition of the parameter space depending on the structure of algebraic local cohomology classes. This decomposition informs us several properties of input ideals and the output of our algorithm completely ...
متن کامل. A G ] 1 4 Fe b 20 07 Approximate radical for clusters : a global ap - proach using Gaussian elimination or SVD
We present a method based on Dickson’s lemma to compute the “approximate radical” of a zero dimensional ideal Ĩ in C[x1, . . . , xm] which has zero clusters: the approximate radical ideal has exactly one root in each cluster for sufficiently small clusters. Our method is “global” in the sense that it does not require any local approximation of the zero clusters: it reduces the problem to the co...
متن کامل0 v 1 [ m at h . A G ] 1 4 Fe b 20 07 Approximate radical for clusters : a global ap - proach using Gaussian elimination or SVD
We present a method based on Dickson’s lemma to compute the “approximate radical” of a zero dimensional ideal Ĩ in C[x1, . . . , xm] which has zero clusters: the approximate radical ideal has exactly one root in each cluster for sufficiently small clusters. Our method is “global” in the sense that it does not require any local approximation of the zero clusters: it reduces the problem to the co...
متن کاملA New Compromise Decision-making Model based on TOPSIS and VIKOR for Solving Multi-objective Large-scale Programming Problems with a Block Angular Structure under Uncertainty
This paper proposes a compromise model, based on a new method, to solve the multi-objective large-scale linear programming (MOLSLP) problems with block angular structure involving fuzzy parameters. The problem involves fuzzy parameters in the objective functions and constraints. In this compromise programming method, two concepts are considered simultaneously. First of them is that the optimal ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1601.06626 شماره
صفحات -
تاریخ انتشار 2016